Termination of Permutative Conversions in Intuitionistic Gentzen Calculi

نویسنده

  • Helmut Schwichtenberg
چکیده

It is shown that permutative conversions terminate for the cut-free intuitionistic Gentzen (i.e. sequent) calculus; this proves a conjecture by Dyckhoo and Pinto. The main technical tool is a term notation for derivations in Gentzen calculi. These terms may be seen as-terms with explicit substitution, where the latter corresponds to the left introduction rules. Prawitz 7] deenes a map F transforming derivations in the intuitionistic Gentzen (or sequent) calculus LJ into natural deductions in NJ. Moreover he (essentially) proved surjectivity of F by constructing an inverse map G from NJ back to LJ. Howard 3] identiied a class of cut-free sequent derivations { to be called-normal below { corresponding to normal derivation terms (this is stated without proof in 3, Theorem 2]) 1. A number of authors made use of`permutative conversions' to clarify this situation. Zucker 9] showed for the negative fragment of LJ c (i.e. LJ with cut) that two derivations have the same value under F ii they can be transformed into each other by means of permutative conversions (more precisely: permutative conversions in the sense of Kleene 4] and in addition permutations with the cut rule). Pottinger 6] extended Zucker's results to formulas with _ and 9. Mints 5] and independently Dyckhoo and Pinto 1] prove a similar result for cut free calculi, where in Dyckhoo and Pinto 1] the orientation of permutative conversions is taken into account and connuence is proven. Here we prove termination of some versions of the permutative conversion rules; a weaker form of one of our results was conjectured in 1]. For simplicity we restrict attention to the negative fragment of intuitionistic logic (i.e. of minimal logic, since no symbol ? for falsity is present); however, the arguments below can be extended to the full language with _; 9 (thanks to Matthias HH olzl who has checked this). I would like to thank Roy Dyckhoo for making 1] available to me and patiently explaining its results. Moreover, Roy Dyckhoo and Luis Pinto provided useful comments on an earlier draft. The present paper would not have been possible without this interaction. Thanks are also due to JJ org Hudelmaier, Grigori Mints, Anne Troelstra and three anonymous referees for further helpful comments. 1 Derivations as sequent terms Cut-free derivations in the negative fragment of LJ are denoted by sequent terms; the diierence to-terms and hence to derivation terms in natural deduction is that a …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts

This work presents an extension with cuts of Schwichtenberg’s multiary sequent calculus. We identify a set of permutative conversions on it, prove their termination and confluence and establish the permutability theorem. We present our sequent calculus as the typing system of the generalised multiary λ-calculus λJ, a new calculus introduced in this work. λJ corresponds to an extension of λ-calc...

متن کامل

Proof search issues in some non-classical logics

This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investigation into issues in proof search in both these senses for some non-classical logics. Gentzen sys...

متن کامل

Cut Rules and Explicit Substitutions RENÉ

We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deduction systems (i.e., Gentzen-style sequent calculi) in the case of intuitionistic logic. We illustrate this method using two different versions of the cut rule for a variant of the intuitionistic fragment of Kleene's logical deduction system G3. Our systems are in fact cal...

متن کامل

Proof Nets for Intuitionistic Logic

Until the beginning of the 20th century, there was no way to reason formally about proofs. In particular, the question of proof equivalence had never been explored. When Hilbert asked in 1920 for an answer to this very question in his famous program, people started looking for proof formalizations. Natural deduction and sequent calculi, which were invented by Gentzen in 1935, quickly became two...

متن کامل

A proof-theoretical investigation of global intuitionistic (fuzzy) logic

We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced by Takeuti and Titani to formulate an intuitionistic set theory and an intuitionistic fuzzy set theory together with their metatheories. Here we define analytic Gentzen style calculi for GI and GIF. Among other things,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 212  شماره 

صفحات  -

تاریخ انتشار 1999